Expander Graphs in Computer Science
نویسنده
چکیده
منابع مشابه
Expander Graphs
This paper will introduce expander graphs. Kolmogorov and Barzdin’s proof on the three dimensional realization of networks will be discussed as one of the first examples of expander graphs. The last section will discuss error correcting code as an application of expander graphs to computer science.
متن کاملExpander Graphs and Property (t)
Families of expander graphs are sparse graphs such that the number of vertices in each graph grows yet each graph remains difficult to disconnect. Expander graphs are of great importance in theoretical computer science. In this paper we study the connection between the Cheeger constant, a measure of the connectivity of the graph, and the smallest nonzero eigenvalue of the graph Laplacian. We sh...
متن کاملIntroduction to expander graphs
Expander graphs are one of the deepest tools of theoretical computer science and discrete mathematics, popping up in all sorts of contexts since their introduction in the 1970s. Here’s a list of some of the things that expander graphs can be used to do. Don’t worry if not all the items on the list make sense: the main thing to take away is the sheer range of areas in which expanders can be appl...
متن کاملHighly Symmetric Expanders
Expander graphs are relevant to theoretical computer science in addition to the construction of high-performance switching networks. In communication network applications, a high degree of symmetry in the underlying topology is often advantageous, as it may reduce the complexity of designing and analyzing switching and routing algorithms. We give explicit constructions of expander graphs that a...
متن کاملLecture 7 : Expanders
In this lecture we give basic background about expander graphs. Expanders are graphs with strong connectivity properties: every two large subsets of vertices in an expander have many edges connecting them. Surprisingly, one can construct very sparse graphs that are expanders, and this is what makes them so useful. Expanders have a huge number of applications in theoretical computer science: in ...
متن کاملRandom and Pseudo-Random Walks on Graphs
Random walks on graphs have turned out to be a powerful tool in the design of algorithms and other applications. In particular, expander graphs, which are graphs on which random walks have particularly good properties, are extremely useful in complexity and other areas of computer science. In this chapter we study random walks on general regular graphs, leading to a the randomized logspace algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011